搜索资源列表
ksp
- 改进的Dijkstra寻径算法，用来找到从源点到目的节点的前k条最短路径-improved routing algorithm used to find from source to destination node of the first k Shortest Path
KSP dijkstra第k条最短路径算法
- dijkstra第k条最短路径算法 Dijkstra(迪杰斯特拉)算法是典型的最短路径路由算法，用于计算一个节点到其他所有节点的最短路径。-dijkstra Kth shortest path algorithm
KShortestPaths.rar
- K-shortest算法实现，采用Java语言，能根据不同的拓扑找到k条最短路径。非常经典。,K-shortest algorithm using Java language, can be found according to different topological k be the shortest path. Very classic.
fzwlktlj
- 复杂网络中最短K条路径问题的求解算法研究.pdf 求解路径问题的另一新颖的算法-Complex network of K shortest path algorithm to solve the problem. Pdf Routing Problem Solving another novel algorithm
ksp
- 求前k条最短路径,本程序可用于求地图的路线安排和前k个最短路径分配问题，十分管用，可用于2000个点的计算-find out the kth shortest path
K
- K 最短路径 K 最短路径 代码 -improved routing algorithm used to find from source to destination node of the first k Shortest Path
ksp
- 求解K短路问题的一种创新算子的单亲遗传算法源程序，该程序需要一个distance.txt文本文件，从中读取任意两点间距离数据。本程序所解决的为有26个节点的任意两点间K短路问题。-Solving K shortest path problem in an innovative operator of single-parent genetic algorithm source code, the program requires a distance.txt text file, read fr
graphtheory
- 5个关于图论的算法 包括K短路问题 NLOGN问题 二分图匹配问题 费用流问题 最大流问题-5 on the graph theory algorithms, including K shortest path problem NLOGN problems cost bipartite matching maximum flow flow
short-path
- 运筹学中求最短路，k短路，或网路中的排序问题。-Operations research, seeking the shortest path, k short circuit, or network in the scheduling problem.
k-way
- K最短路问题。大家现在已经知道了如何求单源点最短路径问题，但在实际应用中，有时候需要除了需要知道最短路径外，尚需求解次最短路或第三最短路，即要知道多条最短路，并排出其长度增加的顺序。如在通信网络中，有时候某条线路中断，则需要找一个替代的方案，这就需要找到几条最短路以备不时之需。这样一类多条最短路问题即称为K最短路问题。-K shortest path problem. We now know how to find single source shortest path problem, but
kspaddc
- 这是一个求解k条最短路径路由的算法程序，已经调试通过。-This is a solution of the k shortest path routing algorithm, has been through debugging.
TheKstPath
- 从原始点到顶点j的第K条最短路是由原始点到顶点i(i是j的相邻顶点,最短路从i指向j)的第K条最短路-To vertex j from the original point of the first K shortest path from the original point to the vertex i (i is adjacent to vertex j, the shortest path from i to point j) of Article K shortest
graehl
- K最短路径eppstein算法的C语言实现-k shortest path eppstein algorithm
K-Shortest-Path-Yen-Algorithm
- Yen 算法求解最短路径 附加测试代码 例程-Yen shortest path algorithm
K-shortest-Path-tracking
- 参考《Multiple Object Tracker Using K-Shortest Paths》实现的代码，使用K最短路径实现多目标追踪功能。-Reference " Multiple Object Tracker Using K-Shortest Paths" to achieve code, use the shortest path K multi-target tracking capabilities.
shortest-path-of-N
- N最短路径是K最短路径（KSP）的变种，KSP指的是DAG中单源路径中前K条最短的路径- N shortest path is the shortest path (KSP) of K, KSP refers to the DAG in the single source path of the shortest path in the former K
K-shortest-path-Papers
- 第k短路径研究论文，有经过中间节点情况，可以是固定顺序，也可以非固定-K-shortest path research papers, there are cases through intermediate nodes, which can be fixed sequence to be non-fixed
Study-shortest-point-K
- 使用蛙跳算法，对第k短路径问题进行研究，包含经过中间节点的情况，可以是固定顺序也可以不固定顺序。-Use leapfrog algorithm, k-shortest path problem studied, including the case through an intermediate node, which can be fixed to be the order of the order is not fixed.
k-ShortestPath
- 可以自行设立k值实现多条最短路径计算，结果经验证算法无误(The K value can be set up to realize the calculation of the shortest path. The result is proved to be correct)
ksp
- k最短路径实现 用K条最短路径来优化网络传输方式，提高网络的实时性，是在Dijkstra最短路径的基础上，优化备选路径的生成方式，提高信息传输速度。在中继节点故障的情况下，放弃最短路径，使用源节点的次最短路径进行信息传输，而不使用故障节点的前一节点的次最短路径。(K shortest path implementation The shortest path of K bar is used to optimize the network transmission mode and impr